Moebius function on the lattice of dense subgraphs
نویسندگان
چکیده
منابع مشابه
Moebius Function on the Lattice of Dense Subgraphs
The l\[oebius fun ct ion Ik on the Ialti ce of k-de n ~e subg ra phs of a co nnccted graph, defin ed in a pre vious pa per, is calcu lated fo r graphs G containing isthmu scs and a rt icul ators. IJ evaluated for the null graph q, is shown to van ish if a contain s a n isthmus, whi Ie for a ny integer q there exist graphs containing a r t iculators for whi ch II (q,) = q. The " lattice of path ...
متن کاملOn Finding Dense Subgraphs
Given an undirected graph G = (V,E), the density of a subgraph on vertex set S is defined as d(S) = |E(S)| |S| , where E(S) is the set of edges in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion to directed graphs. For a directed graph one notion of density given by Kannan and Vinay is as follows: given...
متن کاملDense Subgraphs on Dynamic Networks
In distributed networks, it is often useful for the nodes to be aware of dense subgraphs, e.g., such a dense subgraph could reveal dense subtructures in otherwise sparse graphs (e.g. the World Wide Web or social networks); these might reveal community clusters or dense regions for possibly maintaining good communication infrastructure. In this work, we address the problem of self-awareness of n...
متن کاملOn Finding Dense Common Subgraphs
We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices S that maximizes some aggregate measure of the density of the subgraphs induced by S in each of the given graphs. Different choices for the aggregation function give rise to variants of the problem that were studied recen...
متن کاملThe Lovász θ function, SVMs and finding large dense subgraphs
The Lovász θ function of a graph, a fundamental tool in combinatorial optimization and approximation algorithms, is computed by solving a SDP. In this paper we establish that the Lovász θ function is equivalent to a kernel learning problem related to one class SVM. This interesting connection opens up many opportunities bridging graph theoretic algorithms and machine learning. We show that ther...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
سال: 1960
ISSN: 0022-4340
DOI: 10.6028/jres.064b.005